No extendable biplane of order nine

The Monoids of Order Eight and Nine

We describe the use of symbolic algebraic computation allied with AI search techniques, applied to the problem of the identification, enumeration and storage of all monoids of order 9 or less. Our approach is novel, using computer algebra to break symmetry and constraint satisfaction search to find candidate solutions. We present new results in algebraic combinatorics: up to isomorphism and ant...

The order: No Code.

Ternary dual codes of the planes of order nine

We determine the minimum weight of the ternary dual codes of each of the four projective planes of order 9, and of the seven affine planes of order 9. The proof includes a construction of a word of small, sometimes minimal, weight in the dual code of any plane of square order containing a Baer subplane. Dedicated to S. S. Shrikhande

asymptotic property of order statistics and sample quntile

چکیده: فرض کنید که تابعی از اپسیلون یک مجموع نامتناهی از احتمالات موزون مربوط به مجموع های جزئی براساس یک دنباله از متغیرهای تصادفی مستقل و همتوزیع باشد، و همچنین فرض کنید توابعی مانند g و h وجود دارند که هرگاه امید ریاضی توان دوم x متناهی و امیدریاضی x صفر باشد، در این صورت می توان حد حاصلضرب این توابع را بصورت تابعی از امید ریاضی توان دوم x نوشت. حالت عکس نیز برقرار است. همچنین ما با استفاده...

Extendable cooperative games

A (TU) cooperative game is extendable (Kikuta and Shapley, 1986) if every core allocation of each sub-game can be extended to a core allocation of the game. It is strongly extendable if any minimal vector in the upper core of any of its sub-games can be extended to a core allocation. We prove that strong extendability is equivalent to largeness of the core (Sharkey, 1982). Further, we character...